Inverse multi-objective combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Multi-Objective Combinatorial Optimization: Problematic and Context
1 CINVESTAV-IPN, Departamento de Computación, Av. IPN No. 2508, Col. San Pedro Zacatenco, México, D.F. 07300, Mexico [email protected] 2 Laboratoire d’Informatique Fondamentale de Lille (LIFL), UMR CNRS 8022, Université Lille 1, Bâtiment M3, 59655 Villeneuve d’Ascq cedex, France 3 INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d’Ascq, Fran...
متن کاملAutomatic Design of Evolutionary Algorithms for Multi-Objective Combinatorial Optimization
Multi-objective evolutionary algorithms (MOEAs) have been the subject of a large research effort over the past two decades. Traditionally, these MOEAs have been seen as monolithic units, and their study was focused on comparing them as blackboxes. More recently, a component-wise view of MOEAs has emerged, with flexible frameworks combining algorithmic components from different MOEAs. The number...
متن کاملMulti-objective Combinatorial Optimization: Beyond the Biobjective Case
09:30 Tristan Cazenave, Marek Cornu, Daniel Vanderpooten A two-phase meta-heuristic applied to the Multi-objective Traveling Salesman Problem Recently, a number of hybrid meta-heuristics have been successfully applied on different problems like the MO Traveling Salesman Problem (TSP), the MO Multidimensional Knapsack Problem and the MO Flow-shop Scheduling Problem. We present a method providing...
متن کاملAn interactive heuristic method for multi-objective combinatorial optimization
We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization (MOCO) problems to construct an approximation of the e$cient set of such problem. In order to deal with large-scale problems, we transform this approach to propose an interactive procedure. The method is tested on the multi-objective knapsack problem and the multi-objective assig...
متن کاملGenetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approximately efficient solutions that will allow the decision maker to choose a good compromise solution. In each iteration, the algorithm draws at random a utility function and constructs a temporary population composed of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.04.024